Optimally small sumsets in finite abelian groups

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On two questions about restricted sumsets in finite abelian groups

Let G be an abelian group of finite order n, and let h be a positive integer. A subset A of G is called weakly h-incomplete if not every element of G can be written as the sum of h distinct elements of A; in particular, if A does not contain h distinct elements that add to zero, then A is called weakly h-zero-sum-free. We investigate the maximum size of weakly hincomplete and weakly h-zero-sum-...

متن کامل

Small asymmetric sumsets in elementary abelian 2-groups

Let A and B be subsets of an elementary abelian 2-group G, none of which are contained in a coset of a proper subgroup. Extending onto potentially distinct summands a result of Hennecart and Plagne, we show that if |A + B| < |A| + |B|, then either A + B = G, or the complement of A + B in G is contained in a coset of a subgroup of index at least 8 (whence |A + B| ≥ 78 |G|). We indicate condition...

متن کامل

On Restricted Sumsets in Abelian Groups of Odd Order

Let G be an abelian group of odd order, and let A be a subset of G. For any integer h such that 2 ≤ h ≤ |A| − 2, we prove that |h∧A| ≥ |A| and equality holds if and only if A is a coset of some subgroup of G, where h∧A is the set of all sums of h distinct elements of A.

متن کامل

Decomposing finite Abelian groups

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).

متن کامل

Factoring finite abelian groups

It is shown that if in the factorization of a finite cyclic group each factor has either prime power order or order equal to the product of two primes then one factor must be periodic. This is shown to be the best possible result of this type.  2004 Elsevier Inc. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2003

ISSN: 0022-314X

DOI: 10.1016/s0022-314x(03)00060-x